A universally acceptable smoothing factor for kernel density estimates
نویسندگان
چکیده
منابع مشابه
Improved Coresets for Kernel Density Estimates
We study the construction of coresets for kernel density estimates. That is we show how to approximate the kernel density estimate described by a large point set with another kernel density estimate with a much smaller point set. For characteristic kernels (including Gaussian and Laplace kernels), our approximation preserves the L∞ error between kernel density estimates within error ε, with cor...
متن کاملUsing Kernel Density Estimates to Investigate Multimodality Using Kernel Density Estimates to Investigate Multimodality
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. SUMMARY A technique for using kernel density estimates to ...
متن کاملTowards Universally Acceptable m-Com Protocol
Online trust is growing in importance. Consumers and businesses, feeling the pressure of economic downturn and terrorism, increasingly look to buy from and do business with the most trusted Web sites. Companies’ perception of customer trust has steadily evolved from being a construct involving security and privacy issues to a multidimensional, complex construct that includes credibility, emotio...
متن کاملNear-Optimal Coresets of Kernel Density Estimates
We construct near-optimal coresets for kernel density estimate for points in Rd when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size O( √ d log(1/ε)/ε), and we show a near-matching lower bound of size Ω( √ d/ε). The upper bound is a polynomial in 1/ε improvement when d ∈ [3, 1/ε2) (for all kernels except the Gaussian kernel which had a ...
متن کاملGeometric Inference on Kernel Density Estimates
We show that geometric inference of a point cloud can be calculated by examining its kernel density estimate with a Gaussian kernel. This allows one to consider kernel density estimates, which are robust to spatial noise, subsampling, and approximate computation in comparison to raw point sets. This is achieved by examining the sublevel sets of the kernel distance, which isomorphically map to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1996
ISSN: 0090-5364
DOI: 10.1214/aos/1032181164